A Simply Typed Context Calculus with First-class Environments
نویسندگان
چکیده
We introduce a simply typed λ-calculus λκε which has both contexts and environments as first-class values. In λκε, holes in contexts are represented by ordinary variables of appropriate types and hole filling is represented by the functional application together with a new abstraction mechanism which takes care of packing and unpacking of the term which is used to fill in the holes of the context. λκε is a conservative extension of the simply typed λβ-calculus, enjoys subject reduction property, is confluent and strongly normalizing. The traditional method of defining substitution does not work for our calculus. So, we also introduce a new method of defining substitution. Although we introduce the new definition of substitution out of necessity, the new definition turns out to be conceptually simpler than the traditional definition of substitution.
منابع مشابه
Translation of rst-class environments to records
We have studied a calculus with rst-class environments which originates from the -calculus. We give a translation of the calculus to a record calculus and show fundamental properties by using the translation. First we give a translation of simply typed calculus ! env into simply-typed record calculus ! record , which is used for proving strong normalization of ! env . Second we introduce a tran...
متن کاملSimply Typed Lambda Calculus with First-Class Environments
We propose a lambda calculus X^nv where it is possible to handle first-class environments. This calculus is based on the idea of explicit substitution, that is; /la-calculus. Syntax of /i^t, is obtained by merging the class of terms and the one of substitutions. Reduction is made from the weak reduction of Acr-calculus. Its type system also originates in the one of Aer-calculus. Confluence of /...
متن کاملA simply typed context calculus with rst-class environments
We introduce a simply typed -calculus " which has both contexts and environments as rst-class values. In ", holes in contexts are represented by ordinary variables of appropriate types and hole lling is represented by the functional application together with a new abstraction mechanism which takes care of packing and unpacking of the term which is used to ll in the holes of the context. " is a ...
متن کاملA Context-based Approach to Proving Termination of Evaluation
We show a context-based approach to proving termination of evaluation in reduction semantics (i.e., a form of operational semantics with explicit representation of reduction contexts), using Tait-style reducibility predicates defined on both terms and contexts. We consider the simply typed lambda calculus as well as its extension with abortive control operators for first-class continuations und...
متن کاملStrong Normalisation in the π-Calculus
We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging name-passing interactive behaviour. The proof of strong normalisability combines methods from typed λ-calculi and linear lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Functional and Logic Programming
دوره 2002 شماره
صفحات -
تاریخ انتشار 2001